Opportunistic Network Forwarding Algorithm Based on Node Utility Value
نویسندگان
چکیده
منابع مشابه
Hotspot: Location-based Forwarding Scheme in an Opportunistic Network
In an opportunistic network (OPPNET), the forwarding schemes for adhoc networks are not applicable since there is no complete path between the source and the destination node and relay nodes should store messages when no forwarding opportunity exists. Recently several proper schemes have been proposed in an OPPNET. Among them, floodingbased schemes result in very high network traffic and low tr...
متن کاملA Direction Entropy-Based Forwarding Scheme in an Opportunistic Network
In an opportunistic network, one of the most challenging issues is the equilibrium of the network traffic and transmission delay for forwarding messages. To resolve this problem, we propose a new forwarding scheme, called the direction entropy-based forwarding scheme (DEFS), using the main direction and direction entropy based on the information collected about the directions of the nodes in th...
متن کاملOn Using Probabilistic Forwarding to Improve HEC-Based Data Forwarding in Opportunistic Networks
In this paper, we propose the HEC-PF scheme, an enhancement of our previous H-EC scheme for effective data forwarding in opportunistic networks. The enhanced scheme modifies the aggressive forwarding phase of the H-EC scheme by implementing a new Probabilistic Forwarding feature, which decides whether to forward a message to a newly encountered node based on the delivery probability. Using simu...
متن کاملEffect of Topology Knowledge on Opportunistic Forwarding
Opportunistic forwarding is a simple scheme for packet routing in delay tolerant networks such as duty cycling sensor networks in which reducing energy consumption is a principal goal. While it is simple and can be analytically characterized, it suffers from a high end-to-end latency. In this paper we show how this latency can be drastically reduced if nodes have limited knowledge of network to...
متن کاملPacket-Forwarding Algorithm in DTN Based on the Pheromone of Destination Node
The pheromone can be used for target tracking and, consequently, for packet forwarding to the destination node in delay-tolerant networking. In this study, an initiative community model is proposed by simulating pheromone production and diffusion, which contains all of the nodes that can receive the core node pheromone. We can set the distance of the edge node to the core to be less than five h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/cii2017/17263